Multivariate Polynomials with Arbitrary Number of Variables1
نویسندگان
چکیده
The goal of this article is to define multivariate polynomials in arbitrary number of indeterminates and then to prove that they constitute a ring (over appropriate structure of coefficients). The introductory section includes quite a number of auxiliary lemmas related to many different parts of the MML. The second section characterizes the sequence flattening operation, introduced in [9], but so far lacking theorems about its fundamental properties. We first define formal power series in arbitrary number of variables. The auxiliary concept on which the construction of formal power series is based is the notion of a bag. A bag of a set X is a natural function on X which is zero almost everywhere. The elements of X play the role of formal variables and a bag gives their exponents thus forming a power product. Series are defined for an ordered set of variables (we use ordinal numbers). A series in o variables over a structure S is a function assigning an element of the carrier of S (coefficient) to each bag of o. We define the operations of addition, complement and multiplication for formal power series and prove their properties which depend on assumed properties of the structure from which the coefficients are taken. (We would like to note that proving associativity of multiplication turned out to be technically complicated.) Polynomial is defined as a formal power series with finite number of non zero coefficients. In conclusion, the ring of polynomials is defined.
منابع مشابه
The coefficients of differentiated expansions of double and triple Jacobi polynomials
Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...
متن کاملAn Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]
We design the rst polynomial time (for an arbitrary and xed eld GFq]) (;)-approximation algorithm for the number of zeros of arbitrary polynomial f(x 1 ; : : :; x n) over GFq]. It gives the rst eecient method for estimating the number of zeros and nonzeros of multivariate polynomials over small nite elds other than GF2] (like GF3]), the case important for various circuit approximation technique...
متن کاملSchur type inequalities for multivariate polynomials on convex bodies
In this note we give sharp Schur type inequalities for multivariate polynomials with generalized Jacobi weights on arbitrary convex domains. In particular, these results yield estimates for norms of factors of multivariate polynomials.
متن کاملAn efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
In this paper, we present an efficient and general algorithm for decomposing multivariate polynomials of the same arbitrary degree. This problem, also known as the Functional Decomposition Problem (FDP) (31), is classical in computer algebra. It is the first general method addressing the decomposition of multivariate polynomials (any degree, any number of polynomials). As a byproduct, our appro...
متن کاملFast, exact and stable reconstruction of multivariate algebraic polynomials in Chebyshev form
We describe a fast method for the evaluation of an arbitrary high-dimensional multivariate algebraic polynomial in Chebyshev form at the nodes of an arbitrary rank-1 Chebyshev lattice. Our main focus is on conditions on rank-1 Chebyshev lattices allowing for the exact reconstruction of such polynomials from samples along such lattices and we present an algorithm for constructing suitable rank-1...
متن کامل